CorrIndex: A permutation invariant performance index
نویسندگان
چکیده
Permutation and scaling ambiguities are relevant issues in tensor decomposition source separation algorithms. Although these inevitable when working on real data sets, it is preferred to eliminate uncertainties for evaluating algorithms synthetic sets. As shown the paper, existing performance indices this purpose either greedy unreliable or computationally costly. In we propose a new index, called CorrIndex, whose reliability can be proved theoretically. Moreover, compared previous indices, has low computational cost. Theoretical results computer experiments demonstrate advantages of CorrIndex other indices.
منابع مشابه
Permutation invariant lattices
We say that a Euclidean lattice in Rn is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group Sn, i.e., if the lattice is closed under the action of some non-identity elements of Sn. Given a fixed element τ ∈ Sn, we study properties of the set of all lattices closed under the action of τ : we call such lattices τ -invariant. These lattices natura...
متن کاملSparse permutation invariant covariance estimation
The paper proposes a method for constructing a sparse estimator for the inverse covariance (concentration) matrix in high-dimensional settings. The estimator uses a penalized normal likelihood approach and forces sparsity by using a lasso-type penalty. We establish a rate of convergence in the Frobenius norm as both data dimension p and sample size n are allowed to grow, and show that the rate ...
متن کاملPermutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کاملNon-permutation Invariant Borel Quantifiers
Every permutation invariant Borel subset of the space of countable structures is definable in Lω1ω by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation invariant quantifiers. Moreover we show that for every closed subgroup G of the symmetric group S∞, there is a closed binary quantifier Q such that the G-invariant subsets of the ...
متن کاملEntangling power of permutation-invariant quantum states
We investigate the von Neumann entanglement entropy as function of the size of a subsystem for permutation invariant ground states in models with finite number of states per site, e.g., in quantum spin models. We demonstrate that the entanglement entropy of n sites in a system of length L generically grows as log2 2 en L−n /L +C, where is the on-site spin and C is a function depending only on m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2022
ISSN: ['0165-1684', '1872-7557']
DOI: https://doi.org/10.1016/j.sigpro.2022.108457